Fully abstract submodels of typed lambda calculi

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

LNCS 7941 - Typed Lambda Calculi and Applications

We summarize some recent results showing how the lambdacalculus may be obtained by considering the metric completion (with respect to a suitable notion of distance) of a space of affine lambda-terms, i.e., lambda-terms in which abstractions bind variables appearing at most once. This formalizes the intuitive idea that multiplicative additive linear logic is “dense” in full linear logic (in fact...

متن کامل

Programming in higher-order typed lambda-calculi

Typed A-calculi have been objects of theoretical study for many years. Recently, it has been shown that all the inductively defined types (including numbers, booleans, lists, and trees, as well as more complex structures like typed terms and proofs) can be represented in higher-order A-calculi with no built-in types or type constructors. This raises the possibility of designing practical progra...

متن کامل

Typed lambda calculi and possible worlds models

Course overview (current plan; adjustable) i. Typed lambda calculi and possible worlds models ii. Alternative approaches to meaning iii. Grounded language understanding iv. Question answering: Grounding in databases v. Stochastic lambda calculus vi. Distributional approaches to word meanings vii. Composition in vector-space models 1: tensors viii. Composition in vector-space models 2: recursive...

متن کامل

Continuation Semantics in Typed Lambda-Calculi (Summary)

1. Abstract. This paper reports preliminary work on the semantics of the continuation transform. Previous work on the semantics of continuations has concentrated on untyped lambda-calculi and has used primarily the mechanism of inclusive predicates. Such predicates are easy to understand on atomic values, but they become obscure on functional values. In the case of the typed lambda-calculus, we...

متن کامل

Model-Checking Games for Typed lambda-Calculi

We consider the transfer of verification techniques to structures with binding.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computer and System Sciences

سال: 1986

ISSN: 0022-0000

DOI: 10.1016/0022-0000(86)90041-3